Quantum Fast Fourier Transform Viewed as a Special Case of Recursive Application of Cosine-Sine Decomposition
نویسنده
چکیده
A quantum compiler is a software program for decomposing (“compiling”) an arbitrary unitary matrix into a sequence of elementary operations (SEO). Coppersmith showed that the NB-bit Discrete Fourier Transform matrix UFT can be decomposed in a very efficient way, as a sequence of order(NB ) elementary operations. Can a quantum compiler that doesn’t know a priori about Coppersmith’s decomposition nevertheless decompose UFT as a sequence of order(NB ) elementary operations? In other words, can it rediscover Coppersmith’s decomposition by following a much more general algorithm? Yes it can, if that more general algorithm is the recursive application of the Cosine-Sine Decomposition (CSD).
منابع مشابه
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DSTIV), as well as for the modified discrete cosine transform (MDCT) and its inverse, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from 2N log2 N +O(N...
متن کاملType-II/III DCT/DST algorithms with reduced number of arithmetic operations
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from ∼ 2N log2 N to ∼ 17 9 N log2 N for a power-of-two transform size N . Furthermore, we...
متن کاملA Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...
متن کاملCalculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms
This paper presents a method to improve the calculation of functions which specially demand a great amount of computing resources. The method is based on the choice of a weighted primitive which enables the calculation of function values under the scope of a recursive operation. When tackling the design level, the method shows suitable for developing a processor which achieves a satisfying trad...
متن کاملA Review on Transform Domain Adaptive Filters
In this paper, transform domain adaptive filters are studied and reviewed based on previous researches. In transform domain adaptive filters orthogonality properties of transformation such as discrete cosine transform (DCT), discrete sine transform (DST), wavelet transform and discrete fourier transform (DFT) are used to achieve an improved convergence rate as compared to the time domain analys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008